The numerical measure of a complex matrix

نویسندگان

  • Thierry Gallay
  • Denis Serre
چکیده

We introduce and carefully study a natural probability measure over the numerical range of a complex matrix A ∈ Mn(C). This numerical measure μA can be defined as the law of the random variable 〈AX,X〉 ∈ C when the vector X ∈ C is uniformly distributed on the unit sphere. If the matrix A is normal, we show that μA has a piecewise polynomial density fA, which can be identified with a multivariate B-spline. In the general (nonnormal) case, we relate the Radon transform of μA to the spectrum of a family of Hermitian matrices, and we deduce an explicit representation formula for the numerical density which is appropriate for theoretical and computational purposes. As an application, we show that the density fA is polynomial in some regions of the complex plane which can be characterized geometrically, and we recover some known results about lacunas of symmetric hyperbolic systems in 2 + 1 dimensions. Finally, we prove under general assumptions that the numerical measure of a matrix A ∈ Mn(C) concentrates to a Dirac mass as the size n goes to infinity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

بررسی پایداری حالت همگام در شبکه‌ای از نگاشت‌های آشوبناک با روش سنجه ماتریسی

Stability of synchronous state is a fundamental problem in synchronization. We study Matrix Measure as an approach for investigating of stability of synchronous states of chaotic maps on complex networks. Matrix Measure is a measure which depends on network structure. Using this measure and comparing with synchronization threshold which depends on the function of the map, show us how the synchr...

متن کامل

Higher numerical ranges of matrix polynomials

 Let $P(lambda)$ be an $n$-square complex matrix polynomial, and $1 leq k leq n$ be a positive integer. In this paper, some algebraic and geometrical properties of the $k$-numerical range of $P(lambda)$ are investigated. In particular, the relationship between the $k$-numerical range of $P(lambda)$ and the $k$-numerical range of its companion linearization is stated. Moreover, the $k$-numerical...

متن کامل

Properties of matrices with numerical ranges in a sector

Let $(A)$ be a complex $(ntimes n)$ matrix and assume that the numerical range of $(A)$ lies in the set of a sector of half angle $(alpha)$ denoted by $(S_{alpha})$. We prove the numerical ranges of the conjugate, inverse and Schur complement of any order of $(A)$ are in the same $(S_{alpha})$.The eigenvalues of some kinds of matrix product and numerical ranges of hadmard product, star-congruen...

متن کامل

Higher rank numerical ranges of rectangular matrix polynomials

In this paper, the notion of rank-k numerical range of rectangular complex matrix polynomials are introduced. Some algebraic and geometrical properties are investigated. Moreover, for ϵ > 0; the notion of Birkhoff-James approximate orthogonality sets for ϵ-higher rank numerical ranges of rectangular matrix polynomials is also introduced and studied. The proposed denitions yield a natural genera...

متن کامل

RELIABILITY MEASURES AND SENSITIVITY ANALYSIS OF A COMPLEX MATRIX SYSTEM INCLUDING POWER FAILURE

This paper investigates the reliability characteristics of a complex system having nine subsystems arranged in the form of 3x3 matrix in which each row contains three subsystems. The configuration of the row is of the type 2-out-of-3: F. Each subsystem has n units connected in series. The system fails if any one row containing three subsystems fails. The considered system analyzed incorporating...

متن کامل

Synchronization for Complex Dynamic Networks with State and Coupling Time-Delays

This paper is concerned with the problem of synchronization for complex dynamic networks with state and coupling time-delays. Therefore, larger class and more complicated complex dynamic networks can be considered for the synchronization problem. Based on the Lyapunov-Krasovskii functional, a delay-independent criterion is obtained and formulated in the form of linear matrix inequalities (LMIs)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010